Turan graph

Turan graph
турановский граф

English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. . 1994.

Игры ⚽ Поможем написать реферат

Смотреть что такое "Turan graph" в других словарях:

  • Turán graph — The Turán graph T(13,4) Named after Pál Turán v · …   Wikipedia

  • Turán's theorem — In graph theory, Turán s theorem is a result on the number of edges in a Kr+1 free graph. An n vertex graph that does not contain any (r + 1) vertex clique may be formed by partitioning the set of vertices into r parts of equal or… …   Wikipedia

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

  • Turán number — In mathematics, the Turán number T( n , k , r ) for r graphs of order n is the smallest number of r edges such that every set of k vertices contains an edge. This number was determined for r = 2 by harvtxt|Turán|1941, and the problem for general… …   Wikipedia

  • Pál Turán — Paul (Pál) Turán Born 18 August 1910 …   Wikipedia

  • Satz von Turán — Der Satz von Turán (nach Pál Turán) ist eine Aussage aus dem mathematischen Teilgebiet der Graphentheorie. Er macht eine Aussage über die maximale Anzahl von Kanten, die ein Graph mit gegebener Knotenzahl haben kann, ohne einen vollständigen… …   Deutsch Wikipedia

  • List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 …   Wikipedia

  • Neighbourhood (graph theory) — A graph consisting of 6 vertices and 7 edges For other meanings of neighbourhoods in mathematics, see Neighbourhood (mathematics). For non mathematical neighbourhoods, see Neighbourhood (disambiguation). In graph theory, an adjacent vertex of a… …   Wikipedia

  • Extremal graph theory — is a branch of mathematics. In the narrow sense, extremal graph theory studies the graphs which are extremal among graphs with a certain property. There are various meanings for the word extremal : with the largest number of edges, the largest… …   Wikipedia

  • K-partiter Graph — Ein k partiter Graph ist in der Graphentheorie ein einfacher Graph, dessen Knotenmenge in k disjunkte Teilmengen zerfällt, sodass die Knoten jeder dieser Teilmengen untereinander nicht benachbart sind. Für k = 2 heißen diese Graphen bipartite… …   Deutsch Wikipedia

  • Pál Turán — Pál Turán, 1955 Pál Turán (auch: Paul Turán; * 18. August 1910 in Budapest; † 26. September 1976 ebenda)[1] war ein u …   Deutsch Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»